Action-Space Partitioning for Planning
نویسندگان
چکیده
For autonomous artificial decision-makers to solve realistic tasks, they need to deal with searching through large state and action spaces under time pressure. We study the problem of planning in such domains and show how structured representations of the environment’s dynamics can help partition the action space into a set of equivalence classes at run time. The partitioned action space is then used to produce a reduced set of actions. This technique speeds up search and can yield significant gains in planning efficiency.
منابع مشابه
Analysis and Assessment of Communicative Action Indicators and Variables; a Case of Tehran city, Iran
While there are a wide variety of studies about communicative action theory of Habermas, there is the need for building of indicators and variables for quantitative methods of assessing this concept in a particular case study. Especially as the development of communicative action theory has created new perspectives in urban planning, it is necessary to assess and promote this concept in cities ...
متن کاملA Comparison of Cost Partitioning Algorithms for Optimal Classical Planning
Cost partitioning is a general and principled approach for constructing additive admissible heuristics for state-space search. Cost partitioning approaches for optimal classical planning include optimal cost partitioning, uniform cost partitioning, zero-one cost partitioning, saturated cost partitioning, post-hoc optimization and the canonical heuristic for pattern databases. We compare these a...
متن کاملFlexible binary space partitioning for robotic rescue
In domains such as robotic rescue, robots must plan paths through environments that are complex and dynamic, and in which robots have only incomplete knowledge. This will normally require both diversions from planned paths as well as significant re-planning as events in the domain unfold and new information is acquired. In terms of a representation for path planning, these requirements place si...
متن کاملConstraint Partitioning for Solving Planning Problems with Trajectory Constraints and Goal Preferences
The PDDL3 specifications include soft goals and trajectory constraints for distinguishing highquality plans among the many feasible plans in a solution space. To reduce the complexity of solving a large PDDL3 planning problem, constraint partitioning can be used to decompose its constraints into subproblems of exponentially lower complexity. However, constraint locality due to soft goals and tr...
متن کاملNew Features in SGPlan for Handling Preferences and Constraints in PDDL3.0∗
In this paper, we describe our enhancements incorporated in SGPlan (hereafter called SGPLan5) for supporting the new features of the PDDL3.0 language used in the Fifth International Planning Competition (IPC5). Based on the architecture of SGPlan that competed in the Fourth IPC (hereafter called SGPLan4), SGPLan5 partitions a large planning problem into subproblems, each with its own subgoal, a...
متن کامل